Cubically Convergent Iterations for Invariant Subspace Computation
نویسندگان
چکیده
منابع مشابه
Cubically Convergent Iterations for Invariant Subspace Computation
We propose a Newton-like iteration that evolves on the set of fixed dimensional subspaces of Rn and converges locally cubically to the invariant subspaces of a symmetric matrix. This iteration is compared in terms of numerical cost and global behavior with three other methods that display the same property of cubic convergence. Moreover, we consider heuristics that greatly improve the global be...
متن کاملCubically Convergent Iterations for Invariant
We propose a Newton-like iteration that evolves on the set of fixed dimensional subspaces of Rn and converges locally cubically to the invariant subspaces of a symmetric matrix. This iteration is compared in terms of numerical cost and global behavior with three other methods that display the same property of cubic convergence. Moreover, we consider heuristics that greatly improve the global be...
متن کاملA Family of Cubically Convergent Methods for Solving Nonlinear Equations
Ujević et al. introduced a family of methods for solving nonlinear equations in [7]. For certain choices of parameters, firstly, they showed that the classical Newton’s method is a member of this family and their methods are better than classical Newton’s method. Then they introduced a particular method. However, in most cases, their efficiency is worse than classical Newton’s method. This is t...
متن کاملOn Constructing a Cubically Convergent Numerical Method for Multiple Roots
We propose the numerical method defined by xn+1 = xn − λ f(xn − μh(xn)) f ′(xn) , n ∈ N, and determine the control parameter λ and μ to converge cubically. In addition, we derive the asymptotic error constant. Applying this proposed scheme to various test functions, numerical results show a good agreement with the theory analyzed in this paper and are proven using Mathematica with its high-prec...
متن کاملOn a Cubically Convergent Iterative Method for Matrix Sign
We propose an iterative method for finding matrix sign function. It is shown that the scheme has global behavior with cubical rate of convergence. Examples are included to show the applicability and efficiency of the proposed scheme and its reciprocal.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2004
ISSN: 0895-4798,1095-7162
DOI: 10.1137/s0895479803422002